Decoding of watermarked information signals

ABSTRACT

Method and apparatus are described for compensating for time offset in a received signal, so as to correctly align the frame sequence of a received signal to a sequence of transmitted symbols. Each symbol extends over T s  signal samples. The received signal is first divided into a sequence of frames of length T s , and then each framedivided into a multiplicity of N b  sub-frames. Subsequently, N b  sequences of values are formed, where every successive value in each sequence is derived from the corresponding sub-frame within each successive frame. Each of the N b  sequences is an estimate for the correctly aligned sequence of transmitted symbols.

The present invention relates to apparatus and methods for decoding information that has been embedded in information signals, such as audio, video or data signals.

Watermarking of information signals is a technique for the transmission of additional data along with the information signal. For instance, watermarking techniques can be used to embed copyright and copy control information into audio signals.

The main requirement of a watermarking scheme is that it is not observable (i.e. in the case of an audio signal, it is inaudible) whilst being robust to attacks to remove the watermark from the signal (e.g. removing the watermark will damage the signal). It will be appreciated that the robustness of a watermark will normally be a trade off against the quality of the signal in which the watermark is embedded. For instance, if a watermark is strongly embedded into an audio signal (and is thus difficult to remove) then it is likely that the quality of the audio signal will be reduced.

Various types of audio watermarking schemes have been proposed, each with its own advantages and disadvantages. For instance, one type of audio watermarking scheme is to use temporal correlation techniques to embed the desired data (e.g. copyright information) into the audio signal. This technique is effectively an echo-hiding algorithm, in which the strength of echo is determined by solving a quadratic equation. The quadratic equation is generated by auto-correlation values at two positions: one at delay equal to τ, and one at delay equal to 0. At the detector, the watermark is extracted by determining the ratio of the auto correlation function at the two delay positions.

WO 00/00969 in the name of Aris Technologies describes a technique for embedding or encoding auxiliary signals into an information host or cover signal. A replica of the cover signal, or a portion of the cover signal in a particular domain (time, frequency or space), is generated according to a stego key, which specifies modification values to the parameters of the cover signal. The replica signal is then modified by an auxiliary signal corresponding to the information to be embedded, and inserted back into the cover signal so as to form the stego signal.

At the decoder, in order to extract the original auxiliary data, a replica of the stego signal is generated in the same manner as the replica of the original cover signal, and requires the use of the same stego key. The resulting replica is then correlated with the received stego signal, so as to extract the auxiliary signal. The extraction of the auxiliary signal is relatively complex, and requires the stego key at both the encoder (or embedder) and decoder (or detector). Additionally, a brute force search is required to synchronize to the auxiliary signal at the detector.

Further, performance of the payload extraction is dependent on how well the auxiliary signal can be estimated. In a system with a high expected error rate of the payload bits in the auxiliary signal, this is very difficult to achieve. Solutions would lead to very complex error correction methods, or significantly limit the information capacity.

It is an object of the present invention to provide a compensation for time offset for a watermark decoding scheme that substantially addresses at least one of the problems of the prior art.

In a first aspect, the present invention provides a method of compensating for offset in a received signal, the signal being modified by a sequence of symbols, each symbol extending over T_(s) signal samples, the method comprising the steps of: (a) dividing the received signal into frames of predetermined length T_(s); (b) dividing each frame into a plurality of N_(b) sub-frames; (c) forming N_(b) sequences of values, the values being derived from the corresponding sub-frame within each frame; and (d) taking said N_(b) sequences as successive estimates of a frame sequence correctly aligned (with no offset) to the sequence of symbols.

Preferably, each frame overlaps an adjacent frame.

Preferably, each sub-frame overlaps an adjacent sub-frame.

Preferably, N_(b) lies within the range 2 to 8.

Preferably, the sequence of symbols comprises L_(w) symbols, the received signal being divided into L_(F) frames, wherein L_(F) is an integer multiple of T_(s)·L_(w).

Preferably, each symbol of the said sequence extends over T_(s) samples.

Preferably, said symbols are shaped with a window shaping function that has a band limited frequency behavior and, within the pass band, has a smooth (graceful) temporal behavior. Further, the window shaping function preferably has a symmetric or anti-symmetric temporal behavior.

Preferably, said window shaping function is one of raised cosine functions or bi-phase functions.

Preferably, said offset is a time offset between the received and the transmitted signals.

Preferably, the method further comprises processing each estimate generated in step (d) as though it was the correctly aligned frame sequence, so as to determine which estimate is the best estimate.

The method preferably further comprises the step of correlating each of said estimates with a reference sequence corresponding to said sequence of symbols; and taking the estimate with the maximum correlation peak value as the best estimate.

Preferably, the best estimate is assumed to be the first estimate that, when processed, exceeds one or more predetermined conditions. Preferably, the processing of estimates stops once a working estimate has been determined.

Preferably, once a working estimate has been determined for a first signal or portion of a signal, the method is repeated for a further received signal or portion of a signal, the estimates from said further signal being processed in an order dependent upon said first best estimate. Thus the method can adaptively correct for offset.

In a further aspect, the present invention provides a computer program arranged to perform the above method.

In another aspect, the present invention provides a record carrier comprising the above computer program.

In a further aspect, the present invention provides a method of making available for downloading the above computer program.

In another aspect, the present invention provides an apparatus arranged to compensate for offset in a received signal, the signal being modified by a sequence of symbols, each symbol extending over T_(s) signal samples, the apparatus comprising: a divider arranged to divide the received signal into frames of preferable length T_(s); a divider arranged to divide each frame into a plurality of N_(b) sub-frames; and a processor arranged to form N_(b) sequences of values, the values being derived from the corresponding sub-frame within each frame; and to take said N_(b) sequences as successive estimates of a frame sequence correctly aligned (with no offset) to the sequence of symbols.

For a better understanding of the invention, and to show how embodiments of the same may be carried into effect, reference will now be made, by way of example, to the accompanying diagrammatic drawings in which:

FIG. 1 is a diagram illustrating a watermark embedding apparatus;

FIG. 2 shows a signal portion extraction filter H;

FIGS. 3 a and 3 b show respectively the typical amplitude and phase responses as a function of frequency of the filter H shown in FIG. 2;

FIG. 4 shows the payload embedding and watermark conditioning stage of the apparatus shown in FIG. 1;

FIG. 5 is a diagram illustrating the details of the watermark conditioning apparatus H_(c) of FIG. 4, including charts of the associated signals at each stage;

FIGS. 6 a and 6 b show two preferred alternative window shaping functions s(n) in the form of respectively a raised cosine function and a bi-phase function;

FIGS. 7 a and 7 b show respectively the frequency spectra for a watermark sequence conditioned with a raised cosine and a bi-phase shaping window function;

FIG. 8 is a diagram illustrating a watermark detector in accordance with an embodiment of the present invention;

FIG. 9 diagrammatically shows the whitening filter H_(w) of FIG. 8, for use in conjunction with a raised cosine shaping window function;

FIG. 10 diagrammatically shows the whitening filter H_(w) of FIG. 8, for use in conjunction with a bi-phase window shaping function;

FIG. 11 shows details of the watermark symbol extraction and buffering processes in accordance with an embodiment of the present invention;

FIG. 12 shows a typical shape of the correlation function output from the correlator of the watermark detector shown in FIG. 8; and

FIG. 13 shows an example of one preferred implementation of the symbol extraction and buffering stage.

FIG. 1 shows a block diagram of the apparatus required to perform the digital signal processing for embedding a multi-bit payload watermark w into a host signal x.

A host signal x is provided at an input 12 of the apparatus. The host signal x is passed in the direction of output 14 via the adder 22. However, a replica of the host signal x (input 8) is split off in the direction of the multiplier 18, for carrying the watermark information.

The watermark signal w_(c) is obtained from the payload embedder and watermark conditioning apparatus 6, and derived from a reference finite length random sequence w_(s) input to the payload embedder and watermark conditioning apparatus. The multiplier 18 is utilized to calculate the product of the watermark signal w_(c) and the replica audio signal x. The resulting product, w_(c)x is then passed via a gain controller 24 to the adder 22. The gain controller 24 is used to amplify or attenuate the signal by a gain factor α.

The gain factor α controls the trade off between the audibility and the robustness of the watermark. It may be a constant, or variable in at least one of time, frequency and space. The apparatus in FIG. 1 shows that, when α is variable, it can be automatically adapted via a signal analyzing unit 26 based upon the properties of the host signal x. Preferably, the gain a is automatically adapted, so as to minimize the impact on the signal quality, according to a properly chosen perceptibility cost-function, such as a psycho-acoustic model of the human auditory system (HAS) in case of an audio signal. Such a model is, for instance, described in the paper by E. Zwicker, “Audio Engineering and Psychoacoustics: Matching signals to the final receiver, the Human Auditory System”, Journal of the Audio Engineering Society, Vol. 39, pp. Vol. 115-126, March 1991.

In the following, an audio watermark is utilized, by way of example only, to describe this embodiment of the present invention.

The resulting watermark audio signal y is then obtained at the output 14 of the embedding apparatus 10 by adding an appropriately scaled version of the product of w_(c) and x to the host signal: y[n]=x[n]+αw _(c) [n]x[n].  (1)

Preferably, the watermark w_(c) is chosen such that when multiplied with x, it predominantly modifies the short time envelope of x.

FIG. 2 shows one preferred embodiment in which the input 8 to the multiplier 18 in FIG. 1 is obtained by filtering a replica of the host signal x using a filter H in the filtering unit 15. If the filter output is denoted by x_(b), then according to this preferred embodiment, the watermark signal is generated by adding the product of x_(b) and the watermark w_(c) to the host signal x: y[n]=x+αw _(c) [n]x _(b) [n].  (2)

Let x _(b) be defined such that x _(b)=x−x_(b), and y_(b) be defined such that y=y_(b)+ x _(b), then the envelope modulated portion y_(b) of the watermarked signal y is given as y _(b) [n]=(1+w _(c) [n])x _(b) [n]  (3)

Preferably, as shown in FIG. 3, the filter H is a linear phase band pass filter characterized by its lower cut-off frequency f_(L) and upper cut-off frequency f_(H). As can be seen in FIG. 3( b), the filter H has a linear phase response with respect to frequency f within the pass-band (BW). Thus, when H is a band pass filter, x_(b) and x _(b) are the in-band and out-of-band components of the host signal respectively. For optimum performance, it is preferable that the signals x_(b) and x _(b) are in phase. This is achieved by appropriately compensating for the phase distortion produced by filter H. In the case of a linear phase filter, the distortion is a simple time delay.

In FIG. 4, the details of the payload embedder and watermark conditioning unit 6 is shown. In this unit, the initial reference random sequence w, is converted into a multi-bit watermark signal w_(c).

Firstly a finite length, preferably zero mean and uniformly distributed random sequence w_(s), from now on also referred to as the watermark seed signal, is generated using a random number generator with an initial seed S. As will be appreciated later, it is preferable that this initial seed S is known to both the embedder and the detector, such that a copy of the watermark signal can be generated at the detector for comparison purposes. This results in the sequence of length L_(w). w _(s) [k]ε[−1,1], for k=0, 1, 2, . . . , L _(w)−1  (4)

It should be noted that in some applications, the seed can be transmitted to the detector via an alternate channel or can be derived from the received signal using some pre-determined protocol.

Then the sequence w_(s) is circularly shifted by the amounts d₁ and d₂ using the circularly shifting unit 30 to obtain the random sequences w_(d1) and w_(d2) respectively. It will be appreciated that these two sequences (w_(d1) and w_(d2)) are effectively a first sequence and a second sequence, with the second sequence being circularly shifted with respect to the first. Each sequence w_(di), i=1,2, is subsequently multiplied with a respective sign bit r_(i), in the multiplying unit 40, where r_(i)=+1 or −1. The respective values of r₁ and r₂ remain constant, and only change when the payload of the watermark is changed. Each sequence is then converted into a periodic, slowly varying narrow-band signal w_(i) of length L_(w)T_(s) by the watermark conditioning circuit 20 shown in FIG. 4. Finally, the slowly varying narrow-band signals w₁ and w₂ are added with a relative delay T_(r) (where T_(r)<T_(s)) to give the multi-bit payload watermark signal w_(c). This is achieved by first delaying the signal w₂ by the amount T_(r) using delaying unit 45 and subsequently by adding it to w₁ with the adding unit 50.

FIG. 5 shows the watermark conditioning apparatus 20 used in the payload embedder and watermark conditioning apparatus 6 in more detail. The watermark seed signal w_(s) is input to the conditioning apparatus 20.

For convenience, the modification of only one of the sequences w_(di) is shown in FIG. 5, but it will be appreciated that each of the sequences is modified in a similar manner, with the results being added to obtain the watermark signal w_(c).

As shown in FIG. 5, each watermark signal sequence w_(di)[k], i=1,2 is applied to the input of a sample repeater 180. Chart 181 illustrates one of the sequences w_(di) as a sequence of values of random numbers between +1 and −1, with the sequence being of length L_(w). The sample repeater repeats each value within the watermark seed signal sequence T_(s) times, so as to generate a rectangular pulse train signal. T_(s) is referred to as the watermark symbol period and represents the span of the watermark symbol in the audio signal. Chart 183 shows the results of the signal illustrated in chart 181 once it has passed through the sample repeater 180.

A window shaping function s[n], such as a raised cosine window, is then applied to convert the rectangular pulse functions derived from w_(d1) and w_(d2) into slowly varying watermark sequence functions w₁[n] and w₂[n] respectively.

Chart 184 shows a typical raised cosine window shaping function, which is also of span T_(s).

The generated watermark sequences w₁[n] and w₂[n] are then added up with a relative delay T_(r) (where T_(r)<T_(s)) to give the multi-bit payload watermark signal w_(c)[n] i.e., w _(c) [n]=w ₁ [n]+w ₂ [n−T _(r)]  (5)

The value of T_(r) is chosen such that the zero crossings of w₁ match the maximum amplitude points of w₂ and vice-versa. Thus, for a raised cosine window shaping function T_(r)=T_(s)/2, and for a bi-phase window shaping function T_(r)=T_(s)/4. For other window shaping functions, other values of T_(r) are possible.

As will be appreciated by the below description, during detection the correlation of w_(c)[n] will generate two correlation peaks that are separated by pL′ (as can be seen in FIG. 12). pL′ is an estimate of the circular shift pL between w_(d1) and w_(d2), which is part of the payload, and is defined as pL=|d ₂ −d ₁|mod ([L _(w)/2])   (6)

In addition to pL, extra information can be encoded by changing the relative signs of the embedded watermarks.

In the detector, this is seen as a relative sign r_(sign) between the correlation peaks. It may be defined as:

$\begin{matrix} {r_{sign} = {\frac{{2 \cdot \rho_{1}} + \rho_{2} + 3}{2} \in \left\{ {0,1,2,3} \right\}}} & (7) \end{matrix}$ where ρ₁=sign(cL₁) and ρ₂=sign(cL₂) are respectively estimates of the sign bits r₁ (input 80) and r₂ (input 90) of FIG. 4, and cL₁ and cL₂ are the values of the correlation peak corresponding to w_(d1) and w_(d2) respectively. The overall watermark payload pL_(w), for an error-free detection, is then given as a combination of r_(sign) and pL: pL _(w) =<r _(sign) ,pL>.  (8)

The maximum information (I_(max)) in number of bits, that can be carried by a watermark sequence of length L_(w) is thus given by: I _(max)=log₂(4·┐L _(w)/2┐) bits  (9)

In such a scheme, the payload is immune to relative offset between the embedder and the detector, and also to possible time scale modifications.

The window shaping function has been identified as one of the main parameters that controls the robustness and audibility behavior of the present watermarking scheme. As illustrated in FIGS. 6 a and b, two examples of possible window shaping functions are herein described—a raised cosine function and a bi-phase function.

It is preferable to use a bi-phase window function instead of a raised cosine window function, so as to obtain a quasi DC-free watermark signal. This is illustrated in FIGS. 7 a and 7 b, showing the frequency spectra corresponding to a watermark sequence (in this case a sequence of w_(di)[k]={1,1,−1,1,−1,−1,}) conditioned with respectively a raised cosine and a bi-phase window shaping function. As can be seen, the frequency spectrum for the raised cosine conditioned watermark sequence has a maximum at frequency f=0, whilst the frequency spectrum for the bi-phase shaped watermark sequence has a minimum at f=0 i.e. it has very little DC component.

Useful information is only contained in the non-DC component of the watermark. Consequently, for the same added watermark energy, a watermark conditioned with the bi-phase window will carry more useful information than one conditioned by the raised cosine window. As a result, the bi-phase window offers superior audibility performance for the same robustness or, conversely, it allows a better robustness for the same audibility quality.

Such a bi-phase function could be utilized as a window shaping function for other watermarking schemes. In other words, a bi-phase function could be applied to reduce the DC component of signals (such as a watermark) that are to be incorporated into another signal.

FIG. 8 shows a block diagram of a watermark detector (200, 300, 400). The detector consists of three major stages: (a) the watermark symbol extraction stage (200), (b) the buffering and interpolation stage (300), and (c) the correlation and decision stage (400).

In the symbol extraction stage (200), the received watermarked signal y′[n] is processed to generate multiple (N_(b)) estimates of the watermarked sequence. These estimates of the watermark sequence are required to resolve time offset that may exist between the embedder and the detector, so that the watermark detector can synchronize to the watermark sequence inserted in the host signal.

In the buffering and interpolation stage (300), these estimates are de-multiplexed into N_(b) separate buffers, and an interpolation is applied to each buffer to resolve time scale modifications that may have occurred, e.g. a drift in sampling (clock) frequency may have resulted in a stretch or shrink in the time domain signal (i.e. the watermark may have been stretched or shrunk).

In the correlation and decision stage (400), the content of each buffer is correlated with the reference watermark and the maximum correlation peaks are compared against a threshold to determine the likelihood of whether the watermark is indeed embedded within the received signal y′[n].

In order to maximize the accuracy of the watermark detection, the watermark detection process is typically carried out over a length of received signal y′[n] that is 3 to 4 times that of the watermark sequence length. Thus each watermark symbol to be detected can be constructed by taking the average of several estimates of said symbol. This averaging process is referred to as smoothing, and the number of times the averaging is done is referred to as the smoothing factor s_(f). Let L_(D) be the detection window length, defined as the length of the audio segment (in number of samples) over which a watermark detection truth-value is reported. Then, L_(D)=s_(f)L_(w)T_(s), where T_(s) is the symbol period and L_(w) the number of symbols within the watermark sequence. During symbol extraction, a factor T_(s) decimation takes place in the energy computation stage. Thus, the length (L_(b)) of each buffer 320 within the buffering and interpolation stage is L_(b)=s_(f)L_(w).

In the watermark symbol extraction stage 200 shown in FIG. 8, the incoming watermark signal y′[n] is input to the optional signal conditioning filter H_(b) (210). This filter 210 is typically a band pass filter and has the same behavior as the corresponding filter (H, 15) shown in FIG. 2. The output of the filter H_(b) is y′_(b)[n] and, assuming linearity within the transmission medium, it follows from equations (1) and (3): y′ _(b) [n]≈y _(b) [n]=(1+αw[n])x _(b) [n]  (10)

Note that in the above expression, the possible time offset between the embedder and the detector is implicitly ignored. For ease of explanation of the general watermarking scheme principles, from now on, it is assumed that there is perfect synchronism between the embedder and the detector (i.e. no offset). Explanation is given however below in reference to FIG. 11 of how to compensate for time offset in accordance with the present invention.

Note that when no filter is used in the embedder (i.e., when H=1) then H_(b) in the detector can also be omitted, or it can still be included to improve the detection performance. If H_(b) is omitted, then y_(b) in equation (10) is replaced with y. The rest of the processing is the same.

We assume that the audio signal is divided into frames of length T_(s), and that y′_(b,m)[n] is the n-th sample of the m-th filtered frame signal. The energy E[m] corresponding to the m-th frame is:

$\begin{matrix} {{E\lbrack m\rbrack} = {\sum\limits_{n = 0}^{T_{s} - 1}\;{{y_{b,m}^{\prime}\lbrack n\rbrack}}^{2}}} & (11) \end{matrix}$

Combining this with equation 10, it follows that:

$\begin{matrix} {{{E\lbrack m\rbrack} \approx {\sum\limits_{n = 0}^{T_{s} - 1}\;{{y_{b,m}\lbrack n\rbrack}}^{2}}} = {\sum\limits_{n = 0}^{T_{s} - 1}\;{{\left( {1 + {\alpha\;{w_{e}\lbrack m\rbrack}}} \right){x_{b,m}\lbrack n\rbrack}}}^{2}}} & (12) \end{matrix}$ where w_(e)[m] is the m-th extracted watermark symbol and contains N_(b) time-multiplexed estimates of the embedded watermark sequences Solving for w_(e)[m] in equation 12 and ignoring higher order terms of α, gives the following approximation:

$\begin{matrix} {{w_{e}\lbrack m\rbrack} \approx {\frac{1}{2\;\alpha}\left( {\frac{\sum\limits_{n = 0}^{T_{s} - 1}\;{{y_{b,m}\lbrack n\rbrack}}^{2}}{\sum\limits_{n = 0}^{T_{s} - 1}\;{{x_{b,m}\lbrack n\rbrack}}^{2}} - 1} \right)}} & (13) \end{matrix}$

In the watermark extraction stage 200 shown in FIG. 8, the output y′_(b)[n] of the filter H_(b) is provided as an input to a frame divider 220, which divides the audio signal into frames of length T_(s) i.e. into y′_(b,m)[n], with the energy calculating unit 230 then being used to calculate the energy corresponding to each of the framed signals as per equation (12). The output of this energy calculation unit 230 is then provided as an input to the whitening stage H_(w) (240) which performs the function shown in equation 13 so as to provide an output w_(e)[m]. Alternative implementations (240A, 240B) of this whitening stage are illustrated in FIGS. 9 and 10.

It will be realized that the denominator of equation 13 contains a term that requires knowledge of the host (original) signal x. As the signal x is not available to the detector, it means that in order to calculate w_(e)[m] then the denominator of equation 13 must be estimated.

Below is described how such an estimation can be achieved for the two described window shaping functions (the raised cosine window shaping function and the bi-phase window shaping), but it will equally be appreciated that the teaching could be extended to other window shaping functions.

In relation to the raised cosine window shaping function shown in FIG. 6 a, it has been realized that the audio envelope induced by the watermark contributes only to the noisy part of the energy function E[m]. The slowly varying part (i.e. the low frequency components) is predominately due to the contribution of the envelope of the original audio signal x. Thus, equation 13 may be approximated by:

$\begin{matrix} {{w_{e}\lbrack m\rbrack} \approx {\frac{1}{2\;\alpha}\left( {\frac{E\lbrack m\rbrack}{{lowpass}\;\left( {E\lbrack m\rbrack} \right)} - 1} \right)}} & (14) \end{matrix}$ where “lowpass(.)” is a low pass filter function. Thus, it will be appreciated that the whitening filter H_(w) for the raised cosine window shape in the function can be realized as shown in FIG. 9.

As can be seen, such a whitening filter H_(w) (240A) comprises an input 242A for receiving the signal E[m]. A portion of this signal is then passed through the low pass filter 247A to produce a low pass filtered energy signal E_(LP)[m], which in turn is provided as an input to the calculation stage 248A along with the function E[m]. The calculation stage 248A then divides E[m] by E_(LP)[m] to calculate the extracted watermark symbol w_(e)[m].

When a bi-phase window function is employed in the watermark conditioning stage of the embedder, a different approach should be utilized to estimate the envelope of the original audio, and hence to calculate w_(e)[m].

It will be seen by examination of the bi-phase window function shown in FIG. 6 b, that when the audio envelope is modulated with such a window function, the first and the second halves of the frame are scaled in opposite directions. In the detector, this property is utilized to estimate the envelope energy of the host signal x.

Consequently, within the detector, each audio frame is first sub-divided into two halves. The energy functions corresponding to the first and second half-frames are hence given by

$\begin{matrix} {{E_{1}\lbrack m\rbrack} = {\sum\limits_{n = 0}^{{T_{s}/2} - 1}\;{{{y_{b,m}^{\prime}\lbrack n\rbrack}}^{2}\mspace{14mu}{and}}}} & (15) \\ {{E_{2}\lbrack m\rbrack} = {\sum\limits_{n = {T_{s}/2}}^{T_{s} - 1}\;{{y_{b,m}^{\prime}\lbrack n\rbrack}}^{2}}} & (16) \end{matrix}$ respectively. As the envelope of the original audio is modulated in opposite directions within the two sub-frames, the original audio envelope can be approximated as the mean of E₁[m] and E₂[m].

Further, the instantaneous modulation value can be taken as the difference between these two functions. Thus, for the bi-phase window function, the watermark w_(e)[m] can be approximated by:

$\begin{matrix} {{w_{e}\lbrack m\rbrack} \approx {\frac{1}{2\;\alpha}\left( {\frac{{E_{1}\lbrack m\rbrack} - {E_{2}\lbrack m\rbrack}}{{E_{1}\lbrack m\rbrack} + {E_{2}\lbrack m\rbrack}} - 1} \right)}} & (17) \end{matrix}$

Consequently, the whitening filter H_(w) (240B) in FIG. 8 for a bi-phase window shaping function can be realized as shown in FIG. 10. Inputs 242B and 243B respectively receive the energy functions of the first and second half frames E₁[m] and E₂[m]. Each energy function is then split up into two, and provided to adders 245B and 246B which respectively calculate E₁[m]−E₂[m], and E₁[m]+E₂[m]. Both of these calculated functions are then passed to the calculating unit 24B which divides the value from adder 245B by the value from 246B so as to calculate w_(e)[m], containing N_(b) time-multiplexed estimates of the embedded watermark sequences, in accordance with equation 17.

This output w_(e)[m] is then passed to the buffering and interpolation stage 300, where the signal is de-multiplexed by a de-multiplexer 310, buffered in buffers 320 of length L_(b), so as to resolve a lack of synchronism between the embedder and the detector, and interpolated within the interpolation unit 330 so as to compensate for a time scale modification between the embedder and the detector.

In order to maximize the possible robustness of a watermark, it is important to make sure that the watermarking system is immune to time offsets between the embedder and the detector. In other words, the watermark detector must be able to synchronize to the watermark sequence inserted in the host signal.

FIG. 11 illustrates the process carried out by the buffering and interpolation stage 300 to resolve the offset issue. The example described illustrates the process for resolving offset when a raised cosine window shaping function has been employed in the watermark embedding process. However, in principle the same technique is applicable when the bi-phase window shaping function has been used.

Referring to FIG. 11, after filtering by the filter H_(b) 210, the incoming audio signal stream y′_(b)[n] is separated into preferably overlapping frames 302 of effective length T_(s) by the frame divider 220.

Preferably, to resolve possible offset between the embedder and the detector, each frame is divided into N_(b) sub-frames (304 a, 304 b . . . , 304 x), and the above computations (equations (12) to (17)) are applied on a sub-frame basis.

Preferably, each sub-frame overlaps with an adjacent sub-frame. In the example shown, it can be seen that there is a 50% overlap (T_(s)/N_(b)) of each sub-frame (304 a, 304 b, . . . , 304 x), with each of the sub-frames being of length 2T_(s)/N_(b). When overlapping sub-frames are considered, the main frames are preferably longer than the symbol period T_(s) so as to allow inter-frame overlap as shown in FIG. 11.

The energy of the audio is then computed for each sub-frame by the whitening stage 240, and the resulting values are de-multiplexed into the N_(b) buffers 320 by the de-multiplexer 310. Each successive one(B₁, B₂, . . . , B_(Nb)) of the buffers 320 will thus contain a sequence of values, with the first buffer B₁ containing a sequence of values corresponding to the first sub-frame within each frame, the second buffer B₂ containing a sequence of values corresponding to the second sub-frame within each frame etc.

If w_(Di) is the content of the i-th buffer, then it can be shown that: w _(Di) [k]=w _(e) [k·N _(b) +i], k∈{0, . . . ,L _(b)−1}  (18) where L_(b) is the buffer length.

For a raised cosine window shaping function, the energy of the embedded watermark is concentrated near the center of the frame, such that the sub-frame best aligned with the center of the frame will result in a distinctly better estimate of the embedded watermark symbol than all the other sub-frames. Effectively, each buffer thus contains an estimate of the symbol sequence, the estimates corresponding to the sequences having different time offsets.

The sub-frame best aligned with the center of the frame (i.e. the best estimate of the correctly aligned frame) is determined by correlating the contents of each buffer with the reference watermark sequence. The sequence with the maximum correlation peak value is chosen as the best estimate of the correctly aligned frame. The corresponding confidence level, as described below, is used to determine the truth-value of the detection. Preferably, the correlation process is halted once an estimated watermark sequence with a correlation peak above the defined threshold has been found.

Typically, the length of each buffer is between 3 to 4 times the watermark sequence length L_(w), and is thus typically of length between 2048 and 8192 symbols, and N_(b) is typically within the range of 2 to 8.

The buffer is normally 3 to 4 times that of the watermark sequence so that each watermark symbol can be constructed by taking the averages of several estimates of said symbol. This averaging process is referred to as smoothing, and the number of times the averaging is done is referred to as the smoothing factor s_(f). Thus, given the buffer length L_(b) and the watermark sequence length L_(w), the smoothing factor s_(f) is such that: L_(b)=s_(f)L_(w)  (19)

In another preferred embodiment, the detector refines the parameters used in the offset search based upon the results of a previous search step. For instance, if a first series of estimates shows that the results stored in buffer B₃ provide the best estimate of the information signal, then the next offset search (either on the same received signal, or on the signal received during the next detection window) is refined by shifting the position of the sub-frames towards the position of the best estimate sub-frame. The estimates of the sequence having zero offset can thus be iteratively improved.

As shown in FIG. 8, outputs (w_(D1), w_(D2), . . . w_(DNb)) from the buffering stage are passed to the interpolation stage and, after interpolation, the outputs (w_(I1), w_(I2), . . . w_(INb)) of this stage, which are needed to resolve a possible time scale modification in the watermarked signal, are passed to the correlation and decision stage. All of the estimates (w_(I1), w_(I2), . . . w_(INb)) of the watermark corresponding to the different possible offset values are passed to the correlation and decision stage 400.

The correlator 410 calculates the correlation of each estimate w_(Ij), j=1, . . . , N_(b) with respect to the reference watermark sequence w_(c)[k]. Each respective correlation output corresponding to each estimate is then applied to the maximum detection unit 420 which determines which two estimates provided the maximum correlation peak values. These estimates are chosen as the ones that best fit the circularly shifted versions w_(d1) and w_(d2) of the reference watermark. The correlation values for these estimated sequences are passed to the threshold detector and payload extractor unit 430.

The reference watermark sequence w_(s) used within the detector corresponds to (a possibly circularly shifted version of) the original watermark sequence applied to the host signal. For instance, if the watermark signal was calculated using a random number generator with seed S within the embedder, then equally the detector can calculate the same random number sequence using the same random number generation algorithm and the same initial seed S so as to determine the watermark signal. Alternatively, the watermark signal originally applied in the embedder and utilized by the detector as a reference could simply be any predetermined sequence.

FIG. 12 shows a typical shape of a correlation function as output from the correlator 410. The horizontal scale shows the correlation delay (in terms of the sequence samples). The vertical scale on the left hand side (referred to as the confidence level cL) represents the value of the correlation peak-normalized with respect to the standard deviation of the normally distributed correlation function.

As can be seen, the typical correlation is relatively flat with respect to cL, and centered about cL=0. However, the function contains two peaks, which are separated by pL (see equation 6) and extend upwards to cL values that are above the detection threshold when a watermark is present. When the correlation peaks are negative, the above statement applies to their absolute values.

A horizontal line (shown in the FIG. as being set at cL=8.7) represents the detection threshold. The detection threshold value controls the false alarm rate.

Two kinds of false alarms exist: The false positive rate, defined as the probability of detecting a watermark in non watermarked items, and the false negative rate, which is defined as the probability of not detecting a watermark in watermarked items. Generally, the requirement of the false positive alarm is more stringent than that of the false negative. The scale on the right hand side of FIG. 11 illustrates the probability of a false positive alarm b. As can be seen in the example shown, the probability of a false positive b=10⁻¹² is equivalent to the threshold cL=8.7, whilst b=10⁻⁸³ is equivalent to cL=20.

After each detection interval, the detector determines whether the original watermark is present or whether it is not present, and on this basis outputs a “yes” or a “no” decision. If desired, to improve this decision making process, a number of detection windows may be considered. In such an instance, the false positive probability is a combination of the individual probabilities for each detection window considered, dependent upon the desired criteria. For instance, it could be determined that if the correlation function has two peaks above a threshold of cL=7 on any two out of three detection intervals, then the watermark is deemed to be present. Such detection criteria can be altered depending upon the desired use of the watermark signal and to take into account factors such as the original quality of the host signal and how badly the signal is likely to be corrupted during normal transmission.

The payload extractor unit 430 may subsequently be utilized to extract the payload (e.g. information content) from the detected watermark signal. Once the unit has estimated the two correlation peaks cL₁ and cL₂ that exceed the detection threshold, an estimate cL′ of the circular shift cL (defined in equation (6)) is derived as the distance between the peaks. Next, the signs ρ₁ and ρ₂ of the correlation peaks are determined, and hence r_(sign) calculated from equation (7). The overall watermark payload may then be calculated using equation (8).

For instance, it can be seen in FIG. 12 that pL is the relative distance between the two peaks. Both peaks are positive i.e. ρ₁=+1, and ρ₂=+1. From equation (7), r_(sign)=3. Consequently, the payload pL_(w)=<3, pL>.

The symbol extraction and buffering stages described in FIG. 8 can be efficiently implemented by the apparatus 500 shown in FIG. 13. Here, the offset compensation is achieved without any extra computation. It will also be seen that the de-multiplexing is achieved with a simple set of delays and decimation blocks.

First, the incoming frame signal y_(b,m) is subdivided into N_(b) non-overlapping sub-frames of length T_(s)/N_(b) and the energy of each sub-frame is computed using the energy computation unit 230. Secondly, the whitening filter H_(w) is applied in the whitening unit 240. The combination of the delay unit 510 and the adding unit 520 effectively realizes a 50% overlap between adjacent sub-frames. After the watermark symbol sequence w_(e)[m] is generated at the output of the adder unit 520, it is subsequently distributed over the N_(b) buffer unit 320 using the combination of the delay set 512 and the down sampling set 530. This is done such that each buffer gets one value for every N_(b) in coming samples of w_(e)[k]. For instance, if the first sample goes to w_(D1), the second sample goes to w_(D2), third one to w_(D3), . . . , the N_(b)-th one to w_(DNb) and then the (N_(b)+1)-th one goes back to w_(D1) and so on until all the buffers are filled up. Thus the i-th buffer entry w_(Di)[k] may be expressed as w _(Di) [k]=w _(e) [N _(b) k+i],  (20)

It is seen that the sampling frequency of w_(Di)[k] is 1/N_(b) times that of w_(e)[m]. This decimation is achieved via the decimating set 532 in FIG. 13.

Since non-overlapping frames are considered in the energy computing unit 230, the total computation needed to generate the N_(b) sequences is the same as that would have been required if only one sequence with symbols extending over the whole frame was computed.

It will be appreciated by the skilled person that various implementations not specifically described would be understood as falling within the scope of the present invention. For instance, whilst only the functionality of the detecting apparatus has been described, it will be appreciated that the apparatus could be realized as a digital circuit, an analog circuit, a computer program, or a combination thereof.

Equally, whilst the above embodiment has been described with reference to an audio signal, it will be appreciated that the present invention can be applied to add information to other types of signal, for instance information or multimedia signals, such as video and data signals.

Further, it will be appreciated that the invention can be applied to watermarking schemes containing only one watermarking sequence (i.e. a 1-bit scheme), or to watermarking schemes containing multiple watermarking sequences. Such multiple sequences can be simultaneously or successively embedded within the host signal.

Equally, whilst the above detection of the watermark has been described with each estimate being correlated, it will be appreciated that the correlation procedure can be arranged to stop once a positive detection of the watermark has been made. This reduces the offset determination time. Further, the decoder can be arranged to adaptively compensate for time offset, by re-ordering the buffers (or the order in which the buffers are correlated) such that the best aligned buffer in the current detection window will be the first buffer to be correlated in the next detection window.

Within the specification it will be appreciated that the word “comprising” does not exclude other elements or steps, that “a” or “and” does not exclude a plurality, and that a single processor or other unit may fulfil the functions of several means recited in the claims. 

1. A method of processing a received signal, the received signal being modified by a sequence of symbols, each symbol extending over T_(s) signal samples, comprising: dividing the received signal into frames; dividing each frame into a plurality of N_(b) sub-frames, wherein each sub-frame overlaps an adjacent sub-frame; forming N_(b) sequences of values, the values being derived from the corresponding sub-frame within each frame; and taking said N_(b) sequences as successive estimates of a frame sequence correctly aligned to the sequence of symbols.
 2. The method of claim 1, wherein each frame is of predetermined length T_(s).
 3. The method of claim 1, wherein there is an inter-frame overlap of an adjacent frame.
 4. The method of claim 1, wherein N_(b) lies within the range 2 to
 8. 5. The method of claim 1, wherein the sequence of symbols comprises L_(w) symbols, the received signal being divided into L_(F) frames, wherein L_(F) is an integer multiple of L_(w).
 6. The method of claim 1, wherein said sequence of symbols comprises a sequence of values convolved with a window shaping function that has a band limited frequency behavior and is smoothed according to a smoothing factor S_(f).
 7. The method of claim 1, wherein said sequence of symbols comprises a sequence of at least one of raised cosine functions or bi-phase functions.
 8. The method of claim 1, wherein said offset is a time offset.
 9. The method of claim 1, further comprising processing each estimate as though it were the correctly aligned frame sequence for determining which estimate is a best estimate.
 10. The method of claim 9, wherein the best estimate is assumed to be a first estimate that, when processed, exceeds one or more predetermined conditions; said processing of estimates stopping once the best estimate has been determined.
 11. The method of claim 10, further comprising: correlating each of said estimates with a reference corresponding to said sequence of symbols; and taking the estimate with a maximum correlation peak value as the best estimate.
 12. The method of claim 9, wherein once a first best estimate has been determined for a first signal or portion of a signal, the method is repeated for a further received signal or portion of a signal, the estimates from said further signal being processed in an order dependent upon said first best estimate.
 13. An apparatus arranged to compensate for offset in a received signal, the signal being modified by a sequence of symbols, each symbol extending over T_(s) signal samples, comprising: a divider arranged to divide the received signal into frames; a divider arranged to divide each frame into a plurality of N_(b) sub-frames, wherein each sub-frame overlaps an adjacent sub-frame; and a processor arranged to form N_(b) sequences of values, the values being derived from the corresponding sub-frame within each frame; and to take said N_(b) sequences as successive estimates of a frame sequence correctly aligned with the sequence of symbols.
 14. The apparatus of claim 13, the apparatus further comprising a buffer arranged to store said N_(b) sequences.
 15. A decoder arranged to compensate for offset in a received signal, the signal being modified by a sequence of symbols, each symbol extending over T_(s) signal samples, comprising: a divider arranged to divide the received signal into frames; a divider arranged to divide each frame into a plurality of N_(b) sub-frames, wherein each sub-frame overlaps an adjacent sub-frame; and a processor arranged to form N_(b) sequences of values, the values being derived from the corresponding sub-frame within each frame; and to take said N_(b) sequences as successive estimates of a frame sequence correctly aligned with the sequence of symbols. 